ABOUT HILL-CLIMBING PROBLEMS IN STRUCTURAL MECHANICS
نویسندگان
چکیده
منابع مشابه
Combinatorial Auctions , Knapsack Problems , and Hill - climbing
This paper examines the performance of hill-climbing algorithms on standard test problems for combinatorial auctions (CAs). On single-unit CAs, deterministic hill-climbers are found to perform well, and their performance can be improved signiicantly by randomizing them and restarting them several times, or by using them collectively. For some problems this good performance is shown to be no bet...
متن کاملCombinatorial Auctions, Knapsack Problems, and Hill-Climbing Search
This paper examines the performance of hill climbing algo rithms on standard test problems for combinatorial auctions CAs On single unit CAs deterministic hill climbers are found to perform well and their performance can be improved signi cantly by randomizing them and restarting them several times or by using them collectively For some problems this good performance is shown to be no better th...
متن کاملProbabilistic Hill-climbing
Many learning tasks involve searching through a discrete space of performance elements, seeking an element whose future utility is expected to be high. As the task of nding the global optimum is often intractable, many practical learning systems use simple forms of hill-climbing to nd a locally optimal element. However, hill-climbing can be complicated by the fact that the utility value of a pe...
متن کاملStochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called “basin flooding”). We propose and evaluate a stochastic generalization of enforced hill-climbing for online use in goal-oriented probabilistic planning problems. We assume a provided heuristic function estimating expected cost to the goal with fla...
متن کاملAn Evolutionary Hill Climbing Algorithm for Dynamic Optimisation Problems
1 Introduction In contrast to stationary problems where the problem parameters are static, dynamic optimisation problems (DOPs) present a challenging research area to the community [1]. This is mainly because, changes can occur any time during the optimisation course. Hence, when such a change happens (for example a change in the fitness landscape), the previous local optimal solution is no lon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Computational Civil and Structural Engineering
سال: 2017
ISSN: 2588-0195,2587-9618
DOI: 10.22337/2587-9618-2017-13-2-103-124